Termination w.r.t. Q proof of TRS/Cimefilliatre2.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

g₁(A) -> A
g₁(B) -> A
g₁(B) -> B
g₁(C) -> A
g₁(C) -> B
g₁(C) -> C
foldB₂(t, 0) -> t
foldB₂(t, s₁(n)) -> f₂(foldB₂(t, n), B)
foldC₂(t, 0) -> t
foldC₂(t, s₁(n)) -> f₂(foldC₂(t, n), C)
f₂(t, x) -> f'₂(t, g₁(x))
f'₂(triple₃(a, b, c), C) -> triple₃(a, b, s₁(c))
f'₂(triple₃(a, b, c), B) -> f₂(triple₃(a, b, c), A)
f'₂(triple₃(a, b, c), A) -> f''₁(foldB₂(triple₃(s₁(a), 0, c), b))
f''₁(triple₃(a, b, c)) -> foldC₂(triple₃(a, b, 0), c)

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

g₁(A) -> A
g₁(B) -> A
g₁(B) -> B
g₁(C) -> A
g₁(C) -> B
g₁(C) -> C
foldB₂(t, 0) -> t
foldB₂(t, s₁(n)) -> f₂(foldB₂(t, n), B)
foldC₂(t, 0) -> t
foldC₂(t, s₁(n)) -> f₂(foldC₂(t, n), C)
f₂(t, x) -> f'₂(t, g₁(x))
f'₂(triple₃(a, b, c), C) -> triple₃(a, b, s₁(c))
f'₂(triple₃(a, b, c), B) -> f₂(triple₃(a, b, c), A)
f'₂(triple₃(a, b, c), A) -> f''₁(foldB₂(triple₃(s₁(a), 0, c), b))
f''₁(triple₃(a, b, c)) -> foldC₂(triple₃(a, b, 0), c)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F'₂(triple₃(a, b, c), A) -> FOLDB₂(triple₃(s₁(a), 0, c), b)
F₂(t, x) -> F'₂(t, g₁(x))
FOLDC₂(t, s₁(n)) -> F₂(foldC₂(t, n), C)
F₂(t, x) -> G₁(x)
FOLDB₂(t, s₁(n)) -> FOLDB₂(t, n)
F''₁(triple₃(a, b, c)) -> FOLDC₂(triple₃(a, b, 0), c)
FOLDC₂(t, s₁(n)) -> FOLDC₂(t, n)
F'₂(triple₃(a, b, c), A) -> F''₁(foldB₂(triple₃(s₁(a), 0, c), b))
F'₂(triple₃(a, b, c), B) -> F₂(triple₃(a, b, c), A)
FOLDB₂(t, s₁(n)) -> F₂(foldB₂(t, n), B)

The TRS R consists of the following rules:

g₁(A) -> A
g₁(B) -> A
g₁(B) -> B
g₁(C) -> A
g₁(C) -> B
g₁(C) -> C
foldB₂(t, 0) -> t
foldB₂(t, s₁(n)) -> f₂(foldB₂(t, n), B)
foldC₂(t, 0) -> t
foldC₂(t, s₁(n)) -> f₂(foldC₂(t, n), C)
f₂(t, x) -> f'₂(t, g₁(x))
f'₂(triple₃(a, b, c), C) -> triple₃(a, b, s₁(c))
f'₂(triple₃(a, b, c), B) -> f₂(triple₃(a, b, c), A)
f'₂(triple₃(a, b, c), A) -> f''₁(foldB₂(triple₃(s₁(a), 0, c), b))
f''₁(triple₃(a, b, c)) -> foldC₂(triple₃(a, b, 0), c)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F'₂(triple₃(a, b, c), A) -> FOLDB₂(triple₃(s₁(a), 0, c), b)
F₂(t, x) -> F'₂(t, g₁(x))
FOLDC₂(t, s₁(n)) -> F₂(foldC₂(t, n), C)
F₂(t, x) -> G₁(x)
FOLDB₂(t, s₁(n)) -> FOLDB₂(t, n)
F''₁(triple₃(a, b, c)) -> FOLDC₂(triple₃(a, b, 0), c)
FOLDC₂(t, s₁(n)) -> FOLDC₂(t, n)
F'₂(triple₃(a, b, c), A) -> F''₁(foldB₂(triple₃(s₁(a), 0, c), b))
F'₂(triple₃(a, b, c), B) -> F₂(triple₃(a, b, c), A)
FOLDB₂(t, s₁(n)) -> F₂(foldB₂(t, n), B)

The TRS R consists of the following rules:

g₁(A) -> A
g₁(B) -> A
g₁(B) -> B
g₁(C) -> A
g₁(C) -> B
g₁(C) -> C
foldB₂(t, 0) -> t
foldB₂(t, s₁(n)) -> f₂(foldB₂(t, n), B)
foldC₂(t, 0) -> t
foldC₂(t, s₁(n)) -> f₂(foldC₂(t, n), C)
f₂(t, x) -> f'₂(t, g₁(x))
f'₂(triple₃(a, b, c), C) -> triple₃(a, b, s₁(c))
f'₂(triple₃(a, b, c), B) -> f₂(triple₃(a, b, c), A)
f'₂(triple₃(a, b, c), A) -> f''₁(foldB₂(triple₃(s₁(a), 0, c), b))
f''₁(triple₃(a, b, c)) -> foldC₂(triple₃(a, b, 0), c)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F'₂(triple₃(a, b, c), A) -> FOLDB₂(triple₃(s₁(a), 0, c), b)
F₂(t, x) -> F'₂(t, g₁(x))
FOLDC₂(t, s₁(n)) -> F₂(foldC₂(t, n), C)
FOLDB₂(t, s₁(n)) -> FOLDB₂(t, n)
F''₁(triple₃(a, b, c)) -> FOLDC₂(triple₃(a, b, 0), c)
FOLDC₂(t, s₁(n)) -> FOLDC₂(t, n)
F'₂(triple₃(a, b, c), A) -> F''₁(foldB₂(triple₃(s₁(a), 0, c), b))
F'₂(triple₃(a, b, c), B) -> F₂(triple₃(a, b, c), A)
FOLDB₂(t, s₁(n)) -> F₂(foldB₂(t, n), B)

The TRS R consists of the following rules:

g₁(A) -> A
g₁(B) -> A
g₁(B) -> B
g₁(C) -> A
g₁(C) -> B
g₁(C) -> C
foldB₂(t, 0) -> t
foldB₂(t, s₁(n)) -> f₂(foldB₂(t, n), B)
foldC₂(t, 0) -> t
foldC₂(t, s₁(n)) -> f₂(foldC₂(t, n), C)
f₂(t, x) -> f'₂(t, g₁(x))
f'₂(triple₃(a, b, c), C) -> triple₃(a, b, s₁(c))
f'₂(triple₃(a, b, c), B) -> f₂(triple₃(a, b, c), A)
f'₂(triple₃(a, b, c), A) -> f''₁(foldB₂(triple₃(s₁(a), 0, c), b))
f''₁(triple₃(a, b, c)) -> foldC₂(triple₃(a, b, 0), c)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

F'₂(triple₃(a, b, c), A) -> FOLDB₂(triple₃(s₁(a), 0, c), b)
FOLDC₂(t, s₁(n)) -> F₂(foldC₂(t, n), C)
FOLDB₂(t, s₁(n)) -> FOLDB₂(t, n)
FOLDC₂(t, s₁(n)) -> FOLDC₂(t, n)
FOLDB₂(t, s₁(n)) -> F₂(foldB₂(t, n), B)

The remaining pairs can at least be oriented weakly.

F₂(t, x) -> F'₂(t, g₁(x))
F''₁(triple₃(a, b, c)) -> FOLDC₂(triple₃(a, b, 0), c)
F'₂(triple₃(a, b, c), A) -> F''₁(foldB₂(triple₃(s₁(a), 0, c), b))
F'₂(triple₃(a, b, c), B) -> F₂(triple₃(a, b, c), A)

Used ordering: Polynomial interpretation [21]:

POL(0) = 0
POL(A) = 1
POL(B) = 1
POL(C) = 1
POL(F₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(F'₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(F''₁(x₁)) = 2·x₁
POL(FOLDB₂(x₁, x₂)) = 1 + 2·x₁ + 2·x₂
POL(FOLDC₂(x₁, x₂)) = 2·x₁ + 2·x₂
POL(f₂(x₁, x₂)) = 2 + x₁
POL(f'₂(x₁, x₂)) = 2 + x₁
POL(f''₁(x₁)) = x₁
POL(foldB₂(x₁, x₂)) = 1 + x₁ + x₂
POL(foldC₂(x₁, x₂)) = x₁ + x₂
POL(g₁(x₁)) = x₁
POL(s₁(x₁)) = 2 + x₁
POL(triple₃(x₁, x₂, x₃)) = 2·x₂ + x₃

The following usable rules [14] were oriented:

g₁(C) -> B
foldC₂(t, 0) -> t
g₁(A) -> A
g₁(C) -> C
f'₂(triple₃(a, b, c), C) -> triple₃(a, b, s₁(c))
foldB₂(t, 0) -> t
g₁(B) -> A
foldB₂(t, s₁(n)) -> f₂(foldB₂(t, n), B)
g₁(B) -> B
f''₁(triple₃(a, b, c)) -> foldC₂(triple₃(a, b, 0), c)
foldC₂(t, s₁(n)) -> f₂(foldC₂(t, n), C)
f'₂(triple₃(a, b, c), A) -> f''₁(foldB₂(triple₃(s₁(a), 0, c), b))
f'₂(triple₃(a, b, c), B) -> f₂(triple₃(a, b, c), A)
f₂(t, x) -> f'₂(t, g₁(x))
g₁(C) -> A

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F₂(t, x) -> F'₂(t, g₁(x))
F''₁(triple₃(a, b, c)) -> FOLDC₂(triple₃(a, b, 0), c)
F'₂(triple₃(a, b, c), B) -> F₂(triple₃(a, b, c), A)
F'₂(triple₃(a, b, c), A) -> F''₁(foldB₂(triple₃(s₁(a), 0, c), b))

The TRS R consists of the following rules:

g₁(A) -> A
g₁(B) -> A
g₁(B) -> B
g₁(C) -> A
g₁(C) -> B
g₁(C) -> C
foldB₂(t, 0) -> t
foldB₂(t, s₁(n)) -> f₂(foldB₂(t, n), B)
foldC₂(t, 0) -> t
foldC₂(t, s₁(n)) -> f₂(foldC₂(t, n), C)
f₂(t, x) -> f'₂(t, g₁(x))
f'₂(triple₃(a, b, c), C) -> triple₃(a, b, s₁(c))
f'₂(triple₃(a, b, c), B) -> f₂(triple₃(a, b, c), A)
f'₂(triple₃(a, b, c), A) -> f''₁(foldB₂(triple₃(s₁(a), 0, c), b))
f''₁(triple₃(a, b, c)) -> foldC₂(triple₃(a, b, 0), c)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 2 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ QDP

                  ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F₂(t, x) -> F'₂(t, g₁(x))
F'₂(triple₃(a, b, c), B) -> F₂(triple₃(a, b, c), A)

The TRS R consists of the following rules:

g₁(A) -> A
g₁(B) -> A
g₁(B) -> B
g₁(C) -> A
g₁(C) -> B
g₁(C) -> C
foldB₂(t, 0) -> t
foldB₂(t, s₁(n)) -> f₂(foldB₂(t, n), B)
foldC₂(t, 0) -> t
foldC₂(t, s₁(n)) -> f₂(foldC₂(t, n), C)
f₂(t, x) -> f'₂(t, g₁(x))
f'₂(triple₃(a, b, c), C) -> triple₃(a, b, s₁(c))
f'₂(triple₃(a, b, c), B) -> f₂(triple₃(a, b, c), A)
f'₂(triple₃(a, b, c), A) -> f''₁(foldB₂(triple₃(s₁(a), 0, c), b))
f''₁(triple₃(a, b, c)) -> foldC₂(triple₃(a, b, 0), c)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

F'₂(triple₃(a, b, c), B) -> F₂(triple₃(a, b, c), A)

The remaining pairs can at least be oriented weakly.

F₂(t, x) -> F'₂(t, g₁(x))

Used ordering: Polynomial interpretation [21]:

POL(A) = 0
POL(B) = 1
POL(C) = 1
POL(F₂(x₁, x₂)) = 2·x₂
POL(F'₂(x₁, x₂)) = x₂
POL(g₁(x₁)) = 2·x₁
POL(triple₃(x₁, x₂, x₃)) = 2·x₁ + 2·x₂ + 2·x₃

The following usable rules [14] were oriented:

g₁(C) -> B
g₁(B) -> B
g₁(A) -> A
g₁(C) -> C
g₁(B) -> A
g₁(C) -> A

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ QDP

                  ↳ QDPOrderProof

                    ↳ QDP

                      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F₂(t, x) -> F'₂(t, g₁(x))

The TRS R consists of the following rules:

g₁(A) -> A
g₁(B) -> A
g₁(B) -> B
g₁(C) -> A
g₁(C) -> B
g₁(C) -> C
foldB₂(t, 0) -> t
foldB₂(t, s₁(n)) -> f₂(foldB₂(t, n), B)
foldC₂(t, 0) -> t
foldC₂(t, s₁(n)) -> f₂(foldC₂(t, n), C)
f₂(t, x) -> f'₂(t, g₁(x))
f'₂(triple₃(a, b, c), C) -> triple₃(a, b, s₁(c))
f'₂(triple₃(a, b, c), B) -> f₂(triple₃(a, b, c), A)
f'₂(triple₃(a, b, c), A) -> f''₁(foldB₂(triple₃(s₁(a), 0, c), b))
f''₁(triple₃(a, b, c)) -> foldC₂(triple₃(a, b, 0), c)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.